On More General Distributions of Random Binning for Slepian-Wolf Encoding
نویسندگان
چکیده
We consider the problem of (almost) lossless separate encodings and joint decoding two correlated discrete memoryless sources (DMSs), that is, well–known Slepian-Wolf (S-W) source coding problem. Traditionally, ensembles S–W codes are defined such every bin each n–vector is randomly drawn under uniform distribution across sets {0, 1,..., 2nRX -1} 2nRY -1}, where RX RY rates sources, X Y, respectively. In a few more recent works, only one source, say, X, compressed other one, serves as side information available at decoder, scope extended to variable–rate (VRSW) codes, rate allowed depend on type class string, but still, random–binning assumed within corresponding, type–dependent, index set. this expository work, we investigate role uniformity random binning from perspective trade-off between reliability (defined in terms error exponent) compression performance (measured viewpoint exponent). To end, study much wider distributions, which includes ensemble VRSW special case, it also goes considerably beyond. first show that, with exception some pathological cases, smaller ensemble, good larger trade–off exponent exponent. Notwithstanding finding, proposed motivated ways. The outperforms above–mentioned second allows robustness: event system failure causes unavailability bit–stream still reconstruction controllable distortion.
منابع مشابه
"Real" Slepian-Wolf codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class...
متن کاملOn the redundancy of Slepian--Wolf coding
In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...
متن کاملPolar Codes for Nonasymmetric Slepian-Wolf Coding
A method to construct nonasymmetric distributed source coding (DSC) scheme using polar codes which can achieve any point on the dominant face of the Slepian–Wolf (SW) rate region for sources with uniform marginals is considered. In addition to nonasymmetric case, we also discuss and show explicitly how asymmetric and single source compression is done using successive cancellation (SC) polar dec...
متن کاملA Generalized Quantum Slepian-Wolf
In this work we consider a quantum generalization of the task considered by Slepian andWolf [1] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send a part of their respective systems to Charlie without collaborating with each other. We give achievability bounds for this task in the one-shot setting and prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3126980